Spectral factorization of bi-infinite multi-index block Toeplitz matrices

نویسندگان

  • Cornelis V.M. van der Mee
  • Sebastiano Seatzu
  • Giuseppe Rodriguez
چکیده

In this paper we formulate a theory of LU and Cholesky factorization of bi-infinite block Toeplitz matrices A = (Ai−j )i,j∈Zd indexed by i, j ∈ Zd and develop two numerical methods to compute such factorizations. © 2002 Elsevier Science Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ldu Factorization Results for Bi-infinite and Semi-infinite Scalar and Block Toeplitz Matrices

ABSTllACT-In this article various existence results for the LDU-factorization of semi-infinite and bi-infinite scalar and block Toeplitz matrices and numerical methods for computing them are reviewed. Moreover, their application to the orthonormal-ization of splines is indicated. Both banded and non-banded Toeplitz matrices are considered. Extensive use is made of matrix polynomial theory. Resu...

متن کامل

Ldu Factorization Results for Bi - Infinite Andsemi - Infinite Scalar and Block Toeplitz

In this article various existence results for the LDU-factorization of semi-innnite and bi-innnite scalar and block Toeplitz matrices and numerical methods for computing them are reviewed. Moreover, their application to the orthonor-malization of splines is indicated. Both banded and non-banded Toeplitz matrices are considered. Extensive use is made of matrix polynomial theory. Results on the a...

متن کامل

An application of Fibonacci numbers into infinite Toeplitz matrices

The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p

متن کامل

A Toeplitz algorithm for polynomial J-spectral factorization

A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can have zeros along the imaginary axis. The key assumption is that the finite zeros of the input polynomial matrix are given as input data. The algorithm is based on numerically reliable operations only, namely computation ...

متن کامل

A Method for Generating Infinite Positive Self-adjoint Test Matrices and Riesz Bases

In this article we propose a method to easily generate infinite multi-index positive definite self-adjoint matrices as well as Riesz bases in suitable subspaces of L2(Rd). The method is then applied to obtain some classes of multi-index Toeplitz matrices which are bounded and strictly positive on 2(Zd). The condition number of some of these matrices is also computed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000